package com.atcumt.Carl.Dp;

public class Dp07 {

    /*
     * 摘樱桃
     */
    public int cherryPickup(int[][] grid) {

        return 0;
    }

    /*
     * 最大正方形
     * dp[i][j] : 以第i行第j列为右下角所能构成的最大正方形边长
     * dp[i][j] = 1 + min(dp[i - 1][j], dp[i - 1][j], dp[i][j - 1])
     */
    public int maximalSquare(char[][] matrix) {
        int m = matrix.length;
        int n = matrix[0].length;
        int maxLen = Integer.MIN_VALUE;
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (matrix[i - 1][j - 1] == '1'){
                    dp[i][j] = 1 + Math.min(dp[i - 1][j - 1], Math.min(dp[i - 1][j], dp[i][j - 1]));
                    maxLen = Math.max(maxLen, dp[i][j]);
                }
            }
        }
        return maxLen * maxLen;
    }
}
